package leetcode_2301_2400;

import java.util.HashSet;
import java.util.Set;

public class LeeCode_2350 {
    public static void main(String[] args) {

    }
    private static int shortestSequence(int[] rolls, int k) {
        Set<Integer> set = new HashSet<>();
        int ans = 0;
        for (int roll : rolls) {
            set.add(roll);
            if (set.size() == k){
                ans++;
                set.clear();
            }
        }
        return ans + 1;
    }
}